首页> 外文OA文献 >Piecewise-Linear Approximation for Feature Subset Selection in a Sequential Logit Model
【2h】

Piecewise-Linear Approximation for Feature Subset Selection in a Sequential Logit Model

机译:一类特征子集选择的分段线性逼近   顺序Logit模型

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

This paper concerns a method of selecting a subset of features for asequential logit model. Tanaka and Nakagawa (2014) proposed a mixed integerquadratic optimization formulation for solving the problem based on a quadraticapproximation of the logistic loss function. However, since there is asignificant gap between the logistic loss function and its quadraticapproximation, their formulation may fail to find a good subset of features. Toovercome this drawback, we apply a piecewise-linear approximation to thelogistic loss function. Accordingly, we frame the feature subset selectionproblem of minimizing an information criterion as a mixed integer linearoptimization problem. The computational results demonstrate that ourpiecewise-linear approximation approach found a better subset of features thanthe quadratic approximation approach.
机译:本文涉及一种为顺序logit模型选择特征子集的方法。 Tanaka和Nakagawa(2014)提出了一个混合整数二次优化公式,用于基于逻辑损失函数的二次逼近来解决该问题。但是,由于逻辑损失函数与其二次逼近之间存在巨大差距,因此它们的公式化可能无法找到特征的良好子集。为了克服这个缺点,我们对逻辑损失函数应用了分段线性逼近。因此,我们将最小化信息准则的特征子集选择问题构架为混合整数线性优化问题。计算结果表明,逐段线性逼近方法比二次逼近方法具有更好的特征子集。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号